Homomorphic Images of Polynomial Near-rings
نویسنده
چکیده
A polynomial near-ring can mean one of several things. Here a polynomial near-ring is a near-ring of polynomials with the coefficients from a near-ring in the sense of van der Walt and Bagley. We describe quotients of such polynomial near-rings by principal ideals leading to generalizations of some well-known ring constructions. MSC 2000: 16Y30
منابع مشابه
Gray Images of Constacyclic Codes over some Polynomial Residue Rings
Let be the quotient ring where is the finite field of size and is a positive integer. A Gray map of length over is a special map from to ( . The Gray map is said to be a ( )-Gray map if the image of any -constacyclic code over is a -constacyclic code over the field . In this paper we investigate the existence of ( )-Gray maps over . In this direction, we find an equivalent ...
متن کاملOn co-Noetherian dimension of rings
We define and studyco-Noetherian dimension of rings for which the injective envelopeof simple modules have finite Krull-dimension. This is a Moritainvariant dimension that measures how far the ring is from beingco-Noetherian. The co-Noetherian dimension of certain rings,including commutative rings, are determined. It is shown that the class ${mathcal W}_n$ of rings with co-Noetherian dimension...
متن کاملMulti-bit homomorphic encryption based on learning with errors over rings
Basing on Learning with errors over rings (RLWE) assumption, we provide a new multi-bit somewhat homomorphic encryption scheme. We introduce canonical embedding to transform a ring element into a vector, such that polynomial multiplication can be performed in ~ (nlog n) scalar operations, and ciphertext size is reduced at the same time. The CPA security of this scheme can be reduced into RLWE...
متن کاملPractical Fully Homomorphic Encryption for Integers over Polynomial Quotient Rings
In this article we describe a simplified version of Polly Cracker-style fully homomorphic encryption scheme. The main feature of our scheme is an ability to define a strict upper bound of ciphertext size when performing calculations on it for both addition and multiplication. Combined with homomorphic properties of Polly Cracker it’s able to reach high calculation performance without degrading ...
متن کاملMulti-bit homomorphic encryption based on learning with errors over rings
Zhang Wei, Liu Shuguang, Yang Xiaoyuan Key Lab of Computer Network and Information Security under CAPF, Shaanxi 710086, China [email protected] Abstract:Basing on Learning with errors over rings (RLWE) assumption, we provide a new multi-bit somewhat homomorphic encryption scheme. We introduce canonical embedding to transform a ring element into a vector, such that polynomial multiplication ca...
متن کامل